Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Máquina estado finito")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1558

  • Page / 63
Export

Selection :

  • and

Learning Finite-State Machines from Inexperienced TeachersGRINCHTEIN, Olga; LEUCKER, Martin.Lecture notes in computer science. 2006, pp 344-345, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

p-subsequentiable transducersALLAUZEN, Cyril; MOHRI, Mehryar.Lecture notes in computer science. 2003, pp 24-34, issn 0302-9743, isbn 3-540-40391-4, 11 p.Conference Paper

Infinite-state high-level MCS: Model-checking and realizability: (Extended abstract)GENEST, Blaise; MUSCHOLL, Anca; SEIDL, Helmut et al.Lecture notes in computer science. 2002, pp 657-668, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Evaluating two-bit branch predictors for user/kernel codePETROVIC, M; TARTALJA, I.International conference on microelectronic. 1997, pp 827-830, isbn 0-7803-3664-X, 2VolConference Paper

Deduction on the compositions of finite-state modelsNOVORUSSKY, V.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 156-160, isbn 2-9502908-5-X, 2VolConference Paper

From xerox to aspell : A first prototype of a north sámi speller based on TWOL technologyGAUP, Børre; MOSHAGEN, Sjur; OMMA, Thomas et al.Lecture notes in computer science. 2006, pp 306-307, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

A Merging States Algorithm for Inference of RFSAsALVAREZ, Gloria; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 340-341, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Closing the gap between software modelling and codeWAGNER, F; WAGNER, T; WOLSTENHOLME, P et al.IEEE international conference and workshop on the engineering of computer-based systems. 2004, pp 52-59, isbn 0-7695-2125-8, 1Vol, 8 p.Conference Paper

Testing from a finite-state machine : Extending invertibility to sequencesHIERONS, R. M.Computer journal (Print). 1997, Vol 40, Num 4, pp 220-230, issn 0010-4620Article

Finite-state methods and natural language processing (5th international workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005)Yli-Jyrä, Anssi; Karttunen, Lauri; Karhumäki, Juhani et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, XIV-312 p, isbn 978-3-540-35467-3Conference Proceedings

Fault propagation by equation solvingEL-FAKIH, Khaled; YEVTUSHENKO, Nina.Lecture notes in computer science. 2004, pp 185-198, issn 0302-9743, isbn 3-540-23252-4, 14 p.Conference Paper

STRUCTURES NON-CONNEXES. GRAMMAIRE DES INCISES EN FRANÇAIS : DESCRIPTION LINGUISTIQUE ET OUTILS INFORMATIQUES = NON-CONNECTED STRUCTURES. A GRAMMAR OF INSERTS IN FRENCH : LINGUISTIC DESCRIPTION AND COMPUTER TOOLSFairon, Cédrick; Gross, Maurice.2000, 183 p.Thesis

Formalization of edges for the Grafcet state machineGUILLAUME, M; GRAVE, J.-M; CHLIQUE, P et al.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 579-583, isbn 2-9502908-7-6Conference Paper

State-Based Model Slicing: A SurveyANDROUTSOPOULOS, Kelly; CLARK, David; HARMAN, Mark et al.ACM computing surveys. 2013, Vol 45, Num 4, issn 0360-0300, 53.1-53.35Article

Describing verbs in disjoining writing systemsHURSKAINEN, Arvi; LOUWRENS, Louis; POULOS, George et al.Lecture notes in computer science. 2006, pp 292-294, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 3 p.Conference Paper

Tool demonstration : Functional morphologyFORSBERG, Markus; RANTA, Aarne.Lecture notes in computer science. 2006, pp 304-305, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Generalizing redundancy elimination in checking sequencesTUNCAY TEKLE, K; URAL, Hasan; CIHAN YALCIN, M et al.Lecture notes in computer science. 2005, pp 915-926, issn 0302-9743, isbn 3-540-29414-7, 1Vol, 12 p.Conference Paper

Using a minimal number of resets when testing from a finite state machineHIERONS, R. M.Information processing letters. 2004, Vol 90, Num 6, pp 287-292, issn 0020-0190, 6 p.Article

Rule-by-rule input significance analysis in fuzzy system modelingUNCU, Özge; TÜRKSEN, I. B.International Conference of the North American Fuzzy Information Processing Society. 2004, pp 931-935, isbn 0-7803-8376-1, 2Vol, 5 p.Conference Paper

Pattern-based AI scripting using ScriptEaseMCNAUGHTON, Matthew; REDFORD, James; SCHAEFFER, Jonathan et al.Lecture notes in computer science. 2003, pp 35-49, issn 0302-9743, isbn 3-540-40300-0, 15 p.Conference Paper

Commitment machinesYOLUM, Pinar; SINGH, Munindar P.Lecture notes in computer science. 2002, pp 235-247, issn 0302-9743, isbn 3-540-43858-0, 13 p.Conference Paper

Counter-constrained finite state machines: A new model for component protocols with resource-dependenciesREUSSNER, Ralf.Lecture notes in computer science. 2002, pp 20-40, issn 0302-9743, isbn 3-540-00145-X, 21 p.Conference Paper

An algorithmic framework for visualizing statechartsCASTELLO, R; MILI, R; TOLLIS, I. G et al.Lecture notes in computer science. 2001, pp 139-149, issn 0302-9743, isbn 3-540-41554-8Conference Paper

  • Page / 63